Complete Boolean algebra - PDFSEARCH.IO - Document Search Engine

Complete Boolean algebra
Results: 108

#	Item
41	Computational Complexity of SAT, XSAT and NAE-SAT for linear and mixed Horn CNF formulas Inaugural-Dissertation zur Erlangung des Doktorgrades Add to Reading List Source URL: kups.ub.uni-koeln.de Language: English - Date: 2011-03-28 06:57:24 NP-complete problems Logic in computer science Complexity classes Boolean algebra 2-satisfiability Boolean satisfiability problem Conjunctive normal form Outerplanar graph Planar graph Theoretical computer science Graph theory Computational complexity theory
42	Theory and Applications of Categories, Vol. 29, No. 17, 2014, pp. 457–474. EXTENDING OBSTRUCTIONS TO NONCOMMUTATIVE FUNCTORIAL SPECTRA BENNO VAN DEN BERG AND CHRIS HEUNEN Abstract. Any functor from the category of C- Add to Reading List Source URL: www.emis.de Language: English* - Date: 2014-08-14 09:50:00 Algebraic structures Category theory Order theory Boolean algebra Topology Gelfand representation Equivalence of categories Complete Heyting algebra C*-algebra Abstract algebra Mathematics Algebra
43	Logic and Lattices for Distributed Programming Neil Conway William Marczak Peter Alvaro Joseph M. Hellerstein Add to Reading List Source URL: www.eecs.berkeley.edu Language: English - Date: 2012-06-22 16:27:05 Lattice theory Algebra Order theory Lattice Semilattice Class Boolean algebra Monotonic function Complete Heyting algebra Abstract algebra Mathematics Algebraic structures
44	The Complexity of Unique -SAT: An Isolation Lemma for -CNFs Chris Calabro Russell Impagliazzo Valentine Kabanets Ramamohan Paturi Add to Reading List Source URL: cseweb.ucsd.edu Language: English - Date: 2007-10-29 20:04:40 NP-complete problems Boolean algebra Boolean satisfiability problem Electronic design automation Logic in computer science Conjunctive normal form Local search PP NP-complete Theoretical computer science Computational complexity theory Applied mathematics
45	A SURVEY OF RANKING THEORY Wolfgang Spohn Fachbereich Philosophie Universität Konstanz[removed]Konstanz Germany Add to Reading List Source URL: www.uni-konstanz.de Language: English - Date: 2015-01-27 09:49:38 Probability theory Boolean algebra Function Complete Boolean algebra Dempster–Shafer theory Model theory Moment Exponentiation Cardinal number Mathematics Mathematical logic Large cardinals
46	POPPER FUNCTIONS, UNIFORM DISTRIBUTIONS AND INFINITE SEQUENCES OF HEADS ALEXANDER R. PRUSS Abstract. Popper functions allow one to take conditional probabilities as primitive instead of deriving them from unconditional p Add to Reading List Source URL: alexanderpruss.com Language: English - Date: 2014-04-15 12:30:00 Forcing Boolean algebra Probability theory Borel set Descriptive set theory Topology Complete Boolean algebra Countable set Probability space Mathematics Mathematical logic Set theory
47	Board-Level Multiterminal Net Assignment Xiaoyu Song1, William N. N. Hung2, Alan Mishchenko1, Malgorzata Chrzanowska-Jeske1, Alan Coppola3 and Andrew Kennings4 1 Department of ECE, Portland State University, Portland, O Add to Reading List Source URL: www.bvsrc.org Language: English - Date: 2002-03-01 13:11:46 Applied mathematics Logic in computer science NP-complete problems Formal methods Boolean algebra Boolean satisfiability problem Field-programmable gate array Conjunctive normal form Routing Theoretical computer science Electronic engineering Electronic design automation
48	SAT-Based Complete Don’t-Care Computation for Network Optimization Alan Mishchenko and Robert K. Brayton Department of EECS University of California, Berkeley {alanmi, brayton}@eecs.berkeley.edu Add to Reading List Source URL: www.bvsrc.org Language: English - Date: 2004-12-03 17:46:16 Boolean algebra Electronic design automation Formal methods Bioinformatics Boolean network Logic Boolean satisfiability problem Circuit Model checking Theoretical computer science Applied mathematics Mathematics
49	SAT-Based Complete Don’t-Care Computation for Network Optimization Alan Mishchenko Department of EECS University of California, Berkeley [removed] Add to Reading List Source URL: www.bvsrc.org Language: English - Date: 2004-04-30 02:47:03 Boolean algebra Computing Formal methods Electronic design automation Boolean satisfiability problem Boolean network Model checking Canonical form Lookup table Theoretical computer science Logic Mathematics
50	IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS, VOL. 11, NO. 3, JUNE[removed]Transactions Briefs__________________________________________________________________ Board-Level Multiterminal Net Assignm Add to Reading List Source URL: www.bvsrc.org Language: English - Date: 2003-07-31 11:09:07 Logic in computer science NP-complete problems Electronic design automation Formal methods Boolean algebra Boolean satisfiability problem Field-programmable gate array MOS Technology SID Hardware emulation Theoretical computer science Electronic engineering Applied mathematics